c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))
↳ QTRS
↳ DependencyPairsProof
c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))
A(0, x) → C(c(x))
C(c(b(c(x)))) → A(0, c(x))
A(0, x) → C(x)
C(c(x)) → C(b(c(x)))
c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(0, x) → C(c(x))
C(c(b(c(x)))) → A(0, c(x))
A(0, x) → C(x)
C(c(x)) → C(b(c(x)))
c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(0, x) → C(c(x))
C(c(b(c(x)))) → A(0, c(x))
A(0, x) → C(x)
c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(0, x) → C(x)
Used ordering: Polynomial interpretation [25,35]:
A(0, x) → C(c(x))
C(c(b(c(x)))) → A(0, c(x))
The value of delta used in the strict ordering is 8.
POL(C(x1)) = (4)x_1
POL(c(x1)) = 2 + x_1
POL(a(x1, x2)) = 7/2 + (1/2)x_1 + x_2
POL(A(x1, x2)) = 4 + (4)x_1 + (4)x_2
POL(b(x1)) = x_1
POL(0) = 1
c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
A(0, x) → C(c(x))
C(c(b(c(x)))) → A(0, c(x))
c(c(b(c(x)))) → b(a(0, c(x)))
c(c(x)) → b(c(b(c(x))))
a(0, x) → c(c(x))